SAT-Based Algorithms for Logic Minimization
نویسندگان
چکیده
This paper introduces a new method for two-level logic minimization. Unlike previous approaches, the new method uses a SAT solver as an underlying engine. While the overall minimization strategy of the new method is based on the operators as defined in ESPRESSO-II, our SAT-based implementation is significantly different. The new minimizer SAT-ESPRESSO was found to perform 5–20 times faster than ESPRESSO-II and 3–5 times faster than BOOM on a set of large examples.
منابع مشابه
Speeding up SAT Based ATPG for Logic Veri cation by Recursive Learning
Recursive Learning (RL) is a circuit-structure-based method for computing all necessary assignments. Recursive learning technique can be combined with diierent CAD algorithms and techniques in testing, veriication and optimization. In particular, it is used for Automatic test pattern generation(ATPG) which has been applied to many areas of logic synthesis and formal veriication including combin...
متن کاملConstraint models for the bandwidth minimization problem
The satisfiability problem (SAT) is a well studied problem in logic which searches for a truth assignment of a set of Boolean variables that evaluates a specific formula to true. The bandwidth minimization problem for graphs (BMPG) is a well studied problem in graphs and requires finding the labels of the nodes of a graph such that the maximum absolute difference among neighbors is minimized. T...
متن کاملApplying Logic Synthesis for Speeding Up SAT
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the SAT solver technology, for example, perfecting heuristics for variable ordering, and (2) by inventing new ways of constructing simpler SAT problems, either using domain specific information during the translation from...
متن کاملSAT-Based Logic Optimization and Resynthesis
The paper develops a technology-independent optimization and post-mapping resynthesis for combinational logic networks, with emphasis on scalability and optimizing power. The proposed resynthesis (a) is capable of substantial logic restructuring, (b) is customizable to solve a variety of optimization tasks, and (c) has reasonable runtime on large industrial designs. The approach is based on sev...
متن کاملUsing SAT Checkers to Solve The Logic Minimization Problem
We investigate new techniques for solving the two-level logic minimization problem: Given a Boolean function, find the smallest OR-of-ANDs expression that represents it. This is a problem of both theoretical and practical interest. It arises in several fields of Computer Science, such as digital design, reliability analysis and automated reasoning. This project explores a new approach that invo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003